On Jacobi's Extension of the Continued Fraction Algorithm.

نویسنده

  • D N Lehmer
چکیده

1 Adams, W. S., and Kohlschiitter, A., Mt. Wilson Contr. No. 62, Astroph. J., Chicago, Ill., 36, 1912, (293-321). 2 Campbell, W. W., and Wright, W. H., Lick Obs. Bul. No. 8, Berkeley, Cal., 1901. ' Scheiner, J., Astronomical Spectroscopy (Frost), Boston, Mass., 1894, p. 290. 4Michelson, W., Astroph. J., Chicago, Ill., 13, 1901, (192-198). s Paddock, G. F., Pub. Astr. Soc. Pac., San Francisco, Cal., 30, 1918, (244-249), p. 249.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the real quadratic fields with certain continued fraction expansions and fundamental units

The purpose of this paper is to investigate the real quadratic number fields $Q(sqrt{d})$ which contain the specific form of the continued fractions expansions of integral basis element  where $dequiv 2,3( mod  4)$ is a square free positive integer. Besides, the present paper deals with determining the fundamental unit$$epsilon _{d}=left(t_d+u_dsqrt{d}right) 2left.right > 1$$and  $n_d$ and $m_d...

متن کامل

Rigorous Effective Bounds on the Hausdorff Dimension of Continued Fraction Cantor Sets: a Hundred Decimal Digits for the Dimension of E2

We prove that the algorithm of [13] for approximating the Hausdorff dimension of dynamically defined Cantor sets, using periodic points of the underlying dynamical system, can be used to establish completely rigorous high accuracy bounds on the dimension. The effectiveness of these rigorous estimates is illustrated for Cantor sets consisting of continued fraction expansions with restricted digi...

متن کامل

On a class of Lyndon words extending Christoffel words and related to a multidimensional continued fractions algorithm

We define a class of Lyndon words, called Christoffel-Lyndon words. We show that they are in bijection with n-tuples of relatively prime natural numbers. We give a geometrical interpretation of these words. They are linked to an algorithm of Euclidean type. It admits an extension to n-tuples of real numbers; we show that if the algorithm is periodic, then these real numbers are algebraic of deg...

متن کامل

Szegö via Jacobi for Bernd Silbermann on His 65th Birthday

At present there exist numerous different approaches to results on Toeplitz determinants of the type of Szegö's strong limit theorem. The intention of this paper is to show that Jacobi's theorem on the minors of the inverse matrix remains one of the most comfortable tools for tackling the matter. We repeat a known proof of the Borodin-Okounkov formula and thus of the strong Szegö limit theorem ...

متن کامل

On a Class of Lyndon Words Extending Christoffel Words and Related to a Multidimensional Continued Fraction Algorithm

We define a class of Lyndon words, called Christoffel-Lyndon words. We show that they are in bijection with n-tuples of relatively prime natural numbers. We give a geometrical interpretation of these words. They are linked to an algorithm of Euclidean type. It admits an extension to n-tuples of real numbers; we show that if the algorithm is periodic, then these real numbers are algebraic of deg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Proceedings of the National Academy of Sciences of the United States of America

دوره 4 12  شماره 

صفحات  -

تاریخ انتشار 2005